Validating, verifying and testing timed data-flow reactive systems in Coq from controlled natural-language requirements
نویسندگان
چکیده
Data-flow reactive systems (DFRSs) form a class of embedded whose inputs and outputs are always available as signals. Input signals can be seen data provided by sensors, whereas the output to system actuators. In previous works, verifying well-formedness properties DFRS models was accomplished in programmatic way, with no formal guarantees, test cases were generated translating these into other notations. Here, we use Coq single framework specify, validate verify models. Moreover, specification DFRSs is automatically derived from controlled natural-language requirements, formally verified user intervention. System validation supported bounded exploration models; general domain-specific property verification development proof scripts, generation achieved aid QuickChick tool. Considering examples literature, but also aerospace (Embraer) automotive (Mercedes) industries, our automatic testing strategy evaluated terms performance ability detect defects mutation. Within seconds, achieving an average mutation score about 75%.
منابع مشابه
A Formal Model for Natural-Language Timed Requirements of Reactive Systems
To analyse the behaviour of reactive systems formally, it is necessary to build a model. At the very beginning of the development, typically only natural language requirements are documented. We present a formal model, named Data-Flow Reactive Systems (DFRS), which can be automatically obtained from natural language requirements that may also describe temporal properties. We prove that a DFRS c...
متن کاملA Timed Speciication Language for Concurrent Reactive Systems a Timed Speciication Language for Concurrent Reactive Systems
متن کامل
Natural Language Inference in Coq
In this paperwe propose away to dealwith natural language inference (NLI) by implementing Modern Type Theoretical Semantics in the proof assistant Coq. The paper is a first attempt to deal with NLI and natural language reasoning in general by using the proof assistant technology. Valid NLIs are treated as theorems and as such the adequacy of our account is tested by trying to prove them. We use...
متن کاملVerifying Progress in Timed Systems
In this paper we study the issue of progress for distributed timed systems modeled as the parallel composition of timed automata. We clarify the requirements of discrete progress (absence of deadlocks) and time progress (absence of deadlocks and timelocks) and give static sufficient conditions for a model of TA to be deadlockand timelock-free. We also present dynamic techniques for deadlock and...
متن کاملSpecifying and verifying reactive systems in a multi-language environment
The multi-language environment Synchronie supports the design and formal verification of synchronous reactive systems. It integrates three synchronous languages and also three ways to specify properties: the temporal logic with future operators CTL, the temporal logic with past operators Past TL, and observers, which are particular synchronous programs. It is argued that this multi-language fea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2021
ISSN: ['1872-7964', '0167-6423']
DOI: https://doi.org/10.1016/j.scico.2020.102537